Optimal Influencer Marketing Campaign Under Budget Constraints Using Frank-Wolfe

نویسندگان

چکیده

Influencer marketing has become a thriving industry with global market value expected to reach 15 billion dollars by 2022. The advertising problem that such agencies face is the following: given monetary budget find set of appropriate influencers can create and publish posts various types (e.g. text, image, video) for promotion target product. campaign's objective maximize across one or multiple online social platforms some impact metric interest, e.g. number impressions, sales (ROI), audience reach. In this work, we present an original continuous formulation budgeted influencer as convex program. We further propose efficient iterative algorithm based on Frank-Wolfe method, converges optimum low computational complexity. also suggest simpler near-optimal rule thumb, which perform well in many practical scenarios. test our heuristic against several alternatives from optimization literature standard seed selection methods validate superior performance execution time memory, its capability scale problems very large (millions) users.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Marginal Inference in MRFs using Frank-Wolfe

We introduce an algorithm, based on the Frank-Wolfe technique (conditional gradient), for performing marginal inference in undirected graphical models by repeatedly performing MAP inference. It minimizes standard Bethe-style convex variational objectives for inference, leverages known MAP algorithms as black boxes, and offers a principled means to construct sparse approximate marginals for high...

متن کامل

Frank-Wolfe Optimization for Symmetric-NMF under Simplicial Constraint

We propose a Frank-Wolfe (FW) solver to optimize the symmetric nonnegative matrix factorization problem under a simplicial constraint. Compared with existing solutions, this algorithm is extremely simple to implement, and has almost no hyperparameters to be tuned. Building on the recent advances of FW algorithms in nonconvex optimization, we prove an O(1/ε) convergence rate to stationary points...

متن کامل

Repeated Auctions under Budget Constraints: Optimal bidding strategies and Equilibria

How should agents bid in repeated sequential auctions when they are budget constrained? A motivating example is that of sponsored search auctions, where advertisers bid in a sequence of generalized second price (GSP) auctions. These auctions, specifically in the context of sponsored search, have many idiosyncratic features that distinguish them from other models of sequential auctions: First, e...

متن کامل

Frank-Wolfe with Subsampling Oracle

We analyze two novel randomized variants of the Frank-Wolfe (FW) or conditional gradient algorithm. While classical FW algorithms require solving a linear minimization problem over the domain at each iteration, the proposedmethod only requires to solve a linear minimization problem over a small subset of the original domain. The first algorithm that we propose is a randomized variant of the ori...

متن کامل

Training Support Vector Machines Using Frank-Wolfe Optimization Methods

Training a Support Vector Machine (SVM) requires the solution of a quadratic programming problem (QP) whose computational complexity becomes prohibitively expensive for large scale datasets. Traditional optimization methods cannot be directly applied in these cases, mainly due to memory restrictions. By adopting a slightly different objective function and under mild conditions on the kernel use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Network Science and Engineering

سال: 2023

ISSN: ['2334-329X', '2327-4697']

DOI: https://doi.org/10.1109/tnse.2022.3225955